Location:
Search - bfs A
Search list
Description: 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
Platform: |
Size: 1652 |
Author: 李立纯 |
Hits:
Description: 多变量寻优的源码，包括基本算法如下：DFP法（又称变尺度法），BFS法、一阶梯度法，共扼梯度法。-multivariate optimization of the source code, including basic algorithm is as follows : DFP Act (also known as the variable scale), BFS, a ladder degrees, a total of the accused gradient method.
Platform: |
Size: 4664 |
Author: 陈镇静 |
Hits:
Description: 九宫问题（八数码）的一个小软件，实现了多个程序的通讯解题和一套用BFS，双端BFS，A*搜索的分析程序。
rar中含一篇解题报告、软件、及netbeans源码。
环境是JDK1.5_6-JiuGongTu (Digital 8), a small software Implementation of a number of procedures and a set of communication to solve problems with BFS, double-BFS, A * search of analytical procedures. Rar Solution containing a report, software, and Netbeans source. The environment is JDK1.5_6
Platform: |
Size: 1236046 |
Author: wind |
Hits:
Description: n个石头(每相邻两个的距离是1米,最边上石头和岸的距离也是1米),礼物放在第m个石头上,青蛙第i次跳2*i-1米.问能否得到礼物.(n>=49肯定能得到礼物,n<49,可以bfs或递归)-n stones (each of the two adjacent distance of a meter, the most edge of the rocks and the shore is a distance meters), gifts m on the first stone, the frog first time i jump 2* i-1 meter. Gifts can be asked. (NGT; = 49 gift can be sure , 4; 49, zheng or recursive)
Platform: |
Size: 1024 |
Author: 江 |
Hits:
Description: 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Platform: |
Size: 3072 |
Author: 光光 |
Hits:
Description: 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
Platform: |
Size: 1024 |
Author: 李立纯 |
Hits:
Description: 利用BFS算法解八数码问题
在3*3的方格上放着1-8数码，有一空格为0变化规则为空格可以和上，下，右，左四个相邻的数字互换，
至到和目标状态相等，
每一种状态用一个结点表示
而每个结点每次变化最多有四种结点，将这些结点依次入队列中，
例如初始结点S0,入队列后出队，将S0变化最多产生的四种结点S01,S02,S03,S04依次入队列中，
当S01出队后，产生的四种结点S11，S12，S13，S14(实际上不会有四种结点)依次入队，
每次出队时与结束结点相比较，如果相等则退出，
为了，防止已经入队的结点再次入队，(这样会造成列循环),将每次入队的结点设置一个标识号，
四种变化即:向上，向下，向右，向左，我们要求向上和向下互斥，向右和向左互斥-use BFS Algorithm for eight in digital 3* 3, the box copy digital 1-8, 0 for a change in spacing rules for space and can, under the right, left four adjacent digital exchange, and to target state of the same, each state with a node and each said nodes changes each have up to four nodes, and these nodes will be followed into the queue, for example, the initial node S0, out into the queue after the teams will have the most S0 changes of the four nodes S01, S02, SO3, S04-followed cohort, when S01 out teams after the four nodes S11 , S12, S13, S14 (not, in fact, four nodes), followed by the team, each team up with the end node comparison, if the same were to withdraw from, in order to prevent the team has the guitar again joined the team, (this will lead out cycle), each of the team set up a
Platform: |
Size: 13312 |
Author: 刘少人 |
Hits:
Description: 多变量寻优的源码，包括基本算法如下：DFP法（又称变尺度法），BFS法、一阶梯度法，共扼梯度法。-multivariate optimization of the source code, including basic algorithm is as follows : DFP Act (also known as the variable scale), BFS, a ladder degrees, a total of the accused gradient method.
Platform: |
Size: 4096 |
Author: 陈镇静 |
Hits:
Description: RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！
-RBFS algorithm (recursive best first search :* A family) and the LRTA* algorithm (online local search, also known as real-time learning A* search, with the A* family) plans to achieve a single source shortest path. Which RBFS and LRTA* Algorithm than Dilger efficient algorithm!
Platform: |
Size: 19456 |
Author: 陈名 |
Hits:
Description: 九宫问题（八数码）的一个小软件，实现了多个程序的通讯解题和一套用BFS，双端BFS，A*搜索的分析程序。
rar中含一篇解题报告、软件、及netbeans源码。
环境是JDK1.5_6-JiuGongTu (Digital 8), a small software Implementation of a number of procedures and a set of communication to solve problems with BFS, double-BFS, A* search of analytical procedures. Rar Solution containing a report, software, and Netbeans source. The environment is JDK1.5_6
Platform: |
Size: 1235968 |
Author: wind |
Hits:
Description: 采用A*算法完成地图路径规划功能,返回得到最短路径,实际效果优于BFS，DFS等算法。-A* algorithm using maps path planning function returns the shortest path, the actual effects are superior to BFS, algorithms such as DFS.
Platform: |
Size: 7168 |
Author: xiaofeng |
Hits:
Description: 数据结构（C＋＋版）的演示程序，详细演示广度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the breadth- first search specific call process,
Platform: |
Size: 51200 |
Author: znb |
Hits:
Description: 比较DFS与BFS
简单的实现了，小地图范围的两种寻路算法原理的比较。
左键控制，可自动寻找路径，方便观察-DFS compared with the simple realization of BFS, the small scope of the two map routing algorithms for comparison. Left control that can automatically find a path to facilitate the observation
Platform: |
Size: 29696 |
Author: 阿申 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Platform: |
Size: 5120 |
Author: 丁如敏 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Platform: |
Size: 10240 |
Author: 丁如敏 |
Hits:
Description: 双向BFS搜索算法，是针对acm.hdu.edu.cn上1401题所实现的代码，效率非常高。-Bi-directional BFS search algorithm is acm.hdu.edu.cn on the 1401 title by the realization of the code is highly efficient.
Platform: |
Size: 1024 |
Author: sinamaster |
Hits:
Description: This a Breadth First Search algorithm which contains an applet. Extract them from the rar file and run it as an applet.-This is a Breadth First Search algorithm which contains an applet. Extract them from the rar file and run it as an applet.
Platform: |
Size: 2048 |
Author: kanchana |
Hits:
Description: 数据结构中有关图的两种遍历，深度和广度搜索，并有搜索顺序输出-Data structure traversal on the two plans, the depth and breadth of search, and a search order output
Platform: |
Size: 1024 |
Author: 阿狸 |
Hits:
Description: 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。
深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direction of the range as far as possible, until all nodes are not repeated.
Depth first search is started from a node, the first node along its search to further down, when not further backtracking node, then a node in the back in the other direction to start the search depth, until not repeated traversal of all nodes.)
Platform: |
Size: 1024 |
Author: Maxxxxx
|
Hits:
Description: BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
Platform: |
Size: 9216 |
Author: loganic
|
Hits: